On the Hamming distance of constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Distance Constraint Satisfaction Problems
We study the complexity of constraint satisfaction problems for templates Γ that are firstorder definable in (Z; succ), the integers with the successor relation. In the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree), we show that Γ is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and the CSP for Γ ca...
متن کاملOn the Equivalence of Constraint Satisfaction Problems
A solution of a Constraint Satisfaction Problem (CSP) is an assignment of values to all its variables such that all its constraints are satis ed. Usually two CSPs are considered equivalent if they have the same solution set. We nd this de nition limiting, and develop a more general de nition based on the concept of mutual reducibility. In this extended scheme it is reasonable to consider a pair...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملOn Refutation of Random Constraint Satisfaction Problems
Given a k-ary predicate P , a random instance of a constraint satisfaction problem (CSP) is a set of m constraints on n variables. Each constraint is P applied to k random literals. Such an instance is unsatisfiable with high probability when m n. Although this fact can be proven via a simple probabilistic argument, certifying that a given randomly chosen instance is unsatisfiable, a task calle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00146-3